A Proposal to Enhance A-KNN Clustering Method

نویسندگان

  • Kamaljeet Kaur
  • Satwinder Singh
چکیده

To maintain the quality of software and to better understand it, software architecture is decomposed. Software decomposition is done by various clustering methods. Each method provides different results of clustering on datasets. This paper presents the review of various clustering methods with A-KNN method in terms of efficiency and accuracy. It also proposes the way to enhance AKNN clustering technique so that each component of the software can be clustered properly. This enhancement will be done on Euclidean distance by normalization method. Keywords— Clustering, A-KNN, Euclidean distance, Normalization

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

kEFCM: kNN-Based Dynamic Evolving Fuzzy Clustering Method

Despite the recent emergence of research, creating an evolving fuzzy clustering method that intelligently copes with huge amount of data streams in the present high-speed networks involves a lot of difficulties. Several efforts have been devoted to enhance traditional clustering techniques into on-line evolving fuzzy able to learn and develop continuously. In line with these efforts, we propose...

متن کامل

To Enhance A-KNN Clustering Algorithm for Improving Software Architecture

Software Architecture is important factor for the development of complex and big software system. Software Architecture Decomposition is an important part in software design. Software clustering is used to cluster functions of similar type in one cluster and other are in other cluster. Kmean is the base of the clustering but it has some limitations. Many clustering methods are used for decompos...

متن کامل

Optimizing Collaborative Filtering by Interpolating the Individual and Group Behaviors

Collaborative filtering has been very successful in both research and E-commence applications. One of the most popular collaborative filtering algorithms is the k-Nearest Neighbor (KNN) method, which finds k nearest neighbors for a given user to predict his interests. Previous research on KNN algorithm usually suffers from the data sparseness problem, because the quantity of items users voted i...

متن کامل

Fault Detection Using the Clustering-kNN Rule for Gas Sensor Arrays

The k-nearest neighbour (kNN) rule, which naturally handles the possible non-linearity of data, is introduced to solve the fault detection problem of gas sensor arrays. In traditional fault detection methods based on the kNN rule, the detection process of each new test sample involves all samples in the entire training sample set. Therefore, these methods can be computation intensive in monitor...

متن کامل

Nearest Cluster Classifier

In this paper, a new classification method that uses a clustering method to reduce the train set of K-Nearest Neighbor (KNN) classifier and also in order to enhance its performance is proposed. The proposed method is called Nearest Cluster Classifier (NCC). Inspiring the traditional K-NN algorithm, the main idea is to classify a test sample according to the tag of its nearest neighbor. First, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015